-
1 nested automaton
Большой англо-русский и русско-английский словарь > nested automaton
-
2 nested automaton
Математика: вложенный автомат -
3 nested automaton
-
4 nested automaton
The New English-Russian Dictionary of Radio-electronics > nested automaton
-
5 nested automaton
мат. -
6 automaton
-
7 automaton
- anthropomorphic automaton
- asynchronous automaton
- canonical automaton
- cellular automaton
- completely specified automaton
- deterministic automaton
- digital automaton
- discrete automaton
- finite automaton
- finite-state automaton
- fuzzy automaton
- heuristic automaton
- indeterministic automaton
- infinite automaton
- infinite-state automaton
- iterative automaton
- learned automaton
- learning automaton
- linear automaton
- nested automaton
- nonuniform automaton
- piecewise linear automaton
- primary automaton
- probabilistic automaton
- reducible automaton
- redundant automaton
- register automaton
- secondary automaton
- self-adapting automaton
- self-adjusting automaton
- self-reproducing automaton
- stochastic automaton
- symplectic cellular automaton
- synchronous automaton
- tesselation automaton
- uniform automaton -
8 automaton
- anthropomorphic automaton
- asynchronous automaton
- canonical automaton
- cellular automaton
- completely specified automaton
- deterministic automaton
- digital automaton
- discrete automaton
- finite automaton
- finite-state automaton
- fuzzy automaton
- heuristic automaton
- indeterministic automaton
- infinite automaton
- infinite-state automaton
- iterative automaton
- learned automaton
- learning automaton
- linear automaton
- nested automaton
- nonuniform automaton
- piecewise linear automaton
- primary automaton
- probabilistic automaton
- reducible automaton
- redundant automaton
- register automaton
- secondary automaton
- self-adapting automaton
- self-adjusting automaton
- self-reproducing automaton
- stochastic automaton
- symplectic cellular automaton
- synchronous automaton
- tesselation automaton
- uniform automatonThe New English-Russian Dictionary of Radio-electronics > automaton
-
9 вложенный автомат
Большой англо-русский и русско-английский словарь > вложенный автомат
См. также в других словарях:
Nested word — In computer science, more specifically in automata and formal language theory, nested words are a concept proposed by Alur and Madhusudan as a joint generalization of words, as traditionally used for modelling linearly ordered structures, and of… … Wikipedia
Nested stack automaton — In automata theory, a nested stack automaton is a finite automaton that can make use of a stack containing data which can be additional stacks.[1] A nested stack automaton may read its stack, in addition to pushing or popping it. A nested stack… … Wikipedia
Deterministic pushdown automaton — In automata theory, a pushdown automaton is a finite automaton with an additional stack of symbols; its transitions can take the top symbol on the stack and depend on its value, and they can add new top symbols to the stack. A deterministic… … Wikipedia
Deterministic automaton — is a concept of automata theory in which the outcome of a transition from one state to another given a certain input can be predicted for every occurrence. A common deterministic automaton is a deterministic finite state machine (sometimes… … Wikipedia
Switch-technology — is a technology for automata based programming support. It was proposed by Anatoly Shalyto in 1991. It involves software specification, design, implementation, debugging, documentation and maintenance. The term “automata based programming” is… … Wikipedia
Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… … Wikipedia
Context-free grammar — In formal language theory, a context free grammar (CFG) is a formal grammar in which every production rule is of the form V → w where V is a single nonterminal symbol, and w is a string of terminals and/or nonterminals (w can be empty). The… … Wikipedia
Rule 184 — is a one dimensional binary cellular automaton rule, notable for solving the majority problem as well as for its ability to simultaneously describe several, seemingly quite different, particle systems:* Rule 184 can be used as a simple model for… … Wikipedia
List of mathematics articles (N) — NOTOC N N body problem N category N category number N connected space N dimensional sequential move puzzles N dimensional space N huge cardinal N jet N Mahlo cardinal N monoid N player game N set N skeleton N sphere N! conjecture Nabla symbol… … Wikipedia
Deterministic finite-state machine — An example of a Deterministic Finite Automaton that accepts only binary numbers that are multiples of 3. The state S0 is both the start state and an accept state. In the theory of computation and automata theory, a deterministic finite state… … Wikipedia
Chomsky hierarchy — Within the field of computer science, specifically in the area of formal languages, the Chomsky hierarchy (occasionally referred to as Chomsky–Schützenberger hierarchy) is a containment hierarchy of classes of formal grammars. This hierarchy of… … Wikipedia